Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
نویسندگان
چکیده
منابع مشابه
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملA New Hybrid Approach of K-Nearest Neighbors Algorithm with Particle Swarm Optimization for E-Mail Spam Detection
Emails are one of the fastest economic communications. Increasing email users has caused the increase of spam in recent years. As we know, spam not only damages user’s profits, time-consuming and bandwidth, but also has become as a risk to efficiency, reliability, and security of a network. Spam developers are always trying to find ways to escape the existing filters therefore new filters to de...
متن کاملAn Optimal Parallel Algorithm For the All Nearest -- Neighbor Problem for a Convex Polygon
In this paper we give a parallel algorithm for finding the nearest-neighbor vertex of each vertex of a convex polygon. Our algoritb..z::J. runs in O(log n) time using O(njlogn) processors, in the parallel computation model CREW PRA.lvr (ConcurrentRead, Exclusive-Write Parallel RAM). This implies that the all nearest-neighbors problem for a convex polygon can be solved in O(n/p+logn) time using ...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
A Nearest Neighbors Algorithm for Strings
The algorithm is discussed in the context of one of the practical applications: aligning DNA reads to a reference genome. An implementation of the algorithm is shown to align about 106 reads per CPU minute and about 108 base-pairs per CPU minute (human DNA reads). This implementation is compared to the popular software packages Bowtie and BWA, and is shown to be over 5−10 times faster in some a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90084-p